Tight bounds on the competitive ratio on accommodating sequences for the seat reservation problemBACH, Eric; BOYAR, Joan; EPSTEIN, Leah et al.Report - Software engineering. 2000, Num 26, pp 1-16, issn 1386-369XArticle

New results on flow time with resource augmentationEPSTEIN, Leah; VAN STEE, Rob.Report - Software engineering. 2000, Num 28, pp 1-12, issn 1386-369XArticle

On-line scheduling with setup costsGAMBOSI, G; NICOSIA, G.Information processing letters. 2000, Vol 73, Num 1-2, pp 61-68, issn 0020-0190Article

Competitive queue policies for differentiated servicesAIELLO, William A; MANSOUR, Yishay; RAJAGOPOLAN, S et al.Journal of algorithms (Print). 2005, Vol 55, Num 2, pp 113-141, issn 0196-6774, 29 p.Article

Comparing First-Fit and Next-Fit for online edge coloringEHMSEN, Martin R; FAVRHOLDT, Lene M; KOHRT, Jens S et al.Theoretical computer science. 2010, Vol 411, Num 16-18, pp 1734-1741, issn 0304-3975, 8 p.Article

Reducing off-line to on-line: An example and its applicationsDEMANGE, Marc.Yugoslav journal of operations research. 2003, Vol 13, Num 1, pp 3-24, issn 0354-0243, 22 p.Article

On the Bahncard problemFLEISCHER, Rudolf.Theoretical computer science. 2001, Vol 268, Num 1, pp 161-174, issn 0304-3975Conference Paper

Online request server matchingRIEDEL, Marco.Theoretical computer science. 2001, Vol 268, Num 1, pp 145-160, issn 0304-3975Conference Paper

Compositional competitiveness for distributed algorithmsASPNES, James; WAARTS, Orli.Journal of algorithms (Print). 2005, Vol 54, Num 2, pp 127-151, issn 0196-6774, 25 p.Article

Scheduling policies for CIOQ switchesKESSELMAN, Alex; ROSEN, Adi.Journal of algorithms (Print). 2006, Vol 60, Num 1, pp 60-83, issn 0196-6774, 24 p.Article

Online matching on a lineFUCHS, Bernhard; HOCHSTÄTTLER, Winfried; KERN, Walter et al.Theoretical computer science. 2005, Vol 332, Num 1-3, pp 251-264, issn 0304-3975, 14 p.Article

Harmonic buffer management policy for shared memory switchesKESSELMAN, Alexander; MANSOUR, Yishay.Theoretical computer science. 2004, Vol 324, Num 2-3, pp 161-182, issn 0304-3975, 22 p.Article

How to find a point on a line within a fixed distanceHIPKE, C; ICKING, C; KLEIN, R et al.Discrete applied mathematics. 1999, Vol 93, Num 1, pp 67-73, issn 0166-218XArticle

A theoretical comparison of LRU and LRU-KBOYAR, Joan; EHMSEN, Martin R; KOHRT, Jens S et al.Acta informatica. 2010, Vol 47, Num 7-8, pp 359-374, issn 0001-5903, 16 p.Article

Trackless online algorithms for the server problemBEIN, W. W; LARMORE, L. L.Information processing letters. 2000, Vol 74, Num 1-2, pp 73-79, issn 0020-0190Article

Ski rental with two general optionsLOTKER, Zvi; PATT-SHAMIR, Boaz; RAWITZ, Dror et al.Information processing letters. 2008, Vol 108, Num 6, pp 365-368, issn 0020-0190, 4 p.Article

Competitive exploration of rectilinear polygonsHAMMAR, Mikael; NILSSON, Bengt J; PERSSON, Mia et al.Theoretical computer science. 2006, Vol 354, Num 3, pp 367-378, issn 0304-3975, 12 p.Conference Paper

Average-case competitive analyses for ski-rental problemsFUJIWARA, Hiroshi; IWAMA, Kazuo.Algorithmica. 2005, Vol 42, Num 1, pp 95-107, issn 0178-4617, 13 p.Conference Paper

Non-abusiveness helps: An O(1)-competitive algorithm for minimizing the maximum flow time in the online traveling salesman problemKRUMKE, Sven O; LAURA, Luigi; LIPMANN, Maarten et al.Lecture notes in computer science. 2002, pp 200-214, issn 0302-9743, isbn 3-540-44186-7, 15 p.Conference Paper

A risk-reward model for the on-line leasing of depreciable equipmentYONG ZHANG; WEIGUO ZHANG; WEIJUN XU et al.Information processing letters. 2011, Vol 111, Num 6, pp 256-261, issn 0020-0190, 6 p.Article

Deadline scheduling and power management for speed bounded processorsXIN HAN; LAM, Tak-Wah; LEE, Lap-Kei et al.Theoretical computer science. 2010, Vol 411, Num 40-42, pp 3587-3600, issn 0304-3975, 14 p.Article

Dynamic TCP acknowledgment with sliding windowKOGA, Hisashi.Theoretical computer science. 2009, Vol 410, Num 8-10, pp 914-925, issn 0304-3975, 12 p.Article

On the k-orientability of random graphsDEVROYE, Luc; MALALLA, Ebrahim.Discrete mathematics. 2009, Vol 309, Num 6, pp 1476-1490, issn 0012-365X, 15 p.Article

Competitive analysis of most-request-first for scheduling broadcasts with start-up delayHUNG, Regant Y. S; TING, H. F.Theoretical computer science. 2008, Vol 396, Num 1-3, pp 200-211, issn 0304-3975, 12 p.Article

Scheduling to maximize participationCARAGIANNIS, Loannis; KAKLAMANIS, Christos; KANELLOPOULOS, Panagiotis et al.Theoretical computer science. 2008, Vol 402, Num 2-3, pp 142-155, issn 0304-3975, 14 p.Article